G-selc: Optimization by Sequential Elimination of Level Combinations Using Genetic Algorithms and Gaussian Processes by Abhyuday Mandal,1

نویسندگان

  • PRITAM RANJAN
  • C. F. JEFF WU
چکیده

Identifying promising compounds from a vast collection of feasible compounds is an important and yet challenging problem in the pharmaceutical industry. An efficient solution to this problem will help reduce the expenditure at the early stages of drug discovery. In an attempt to solve this problem, Mandal, Wu and Johnson [Technometrics 48 (2006) 273–283] proposed the SELC algorithm. Although powerful, it fails to extract substantial information from the data to guide the search efficiently, as this methodology is not based on any statistical modeling. The proposed approach uses Gaussian Process (GP) modeling to improve upon SELC, and hence named G-SELC. The performance of the proposed methodology is illustrated using four and five dimensional test functions. Finally, we implement the new algorithm on a real pharmaceutical data set for finding a group of chemical compounds with optimal properties.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

G-selc: Optimization by Sequential Elimination of Level Combinations Using Genetic Algorithms and Gaussian Processes

Identifying promising compounds from a vast collection of feasible compounds is an important and yet challenging problem in the pharmaceutical industry. An efficient solution to this problem will help reduce the expenditure at the early stages of drug discovery. In an attempt to solve this problem, Mandal, Wu and Johnson [Technometrics 48 (2006) 273–283] proposed the SELC algorithm. Although po...

متن کامل

SELC: Sequential Elimination of Level Combinations by Means of Modified Genetic Algorithms

To search for an optimum in a large search space, Wu, Mao, Ma (1990) suggested the SEL-method to find an optimal setting. Genetic algorithms (GAs) can be used to improve upon this method. To make the search procedure more efficient, new ideas of forbidden array and weighted mutation are introduced. Relaxing the condition of orthogonality, GAs are able to accommodate a variety of design points w...

متن کامل

Identifying Promising Compounds in Drug Discovery: Genetic Algorithms and Some New Statistical Techniques

Throughout the drug discovery process, discovery teams are compelled to use statistics for making decisions using data from a variety of inputs. For instance, teams are asked to prioritize compounds for subsequent stages of the drug discovery process, given results from multiple screens. To assist in the prioritization process, we propose a desirability function to account for a priori scientif...

متن کامل

Optimization of Cutting Parameters Based on Production Time Using Colonial Competitive (CC) and Genetic (G) Algorithms

A properly designed machining procedure can significantly affect the efficiency of the production lines. To minimize the cost of machining process as well as increasing the quality of products, cutting parameters must permit the reduction of cutting time and cost to the lowest possible levels. To achieve this, cutting parameters must be kept in the optimal range. This is a non-linear optimizati...

متن کامل

SEQUENTIAL PENALTY HANDLING TECHNIQUES FOR SIZING DESIGN OF PIN-JOINTED STRUCTURES BY OBSERVER-TEACHER-LEARNER-BASED OPTIMIZATION

Despite comprehensive literature works on developing fitness-based optimization algorithms, their performance is yet challenged by constraint handling in various engineering tasks. The present study, concerns the widely-used external penalty technique for sizing design of pin-jointed structures. Observer-teacher-learner-based optimization is employed here since previously addressed by a number ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009